Welcome！[Sign In] ！[Sign Up]！
Front-page it | Collect it | [中国-简体中文]
FAQ Fav
Location:
Search - tsp 2-opt

Search list

[Mathimatics-Numerical algorithms] TSP_orC

Description: TSP算法 1.C语言TSP算法 2.2-OPT，orOPT摄动 3.Main单独执行
Platform: | Size: 2206 | Author: DuDu Ch | Hits:

[AI-NN-PR] 2opt

Description: 求解tsp问题的局部优化算法-the local optimization algorithm
Platform: | Size: 45056 | Author: 曲晓威 | Hits:

[AI-NN-PR] tsp(2)

Description: 本程序实现了多城市的tsp问题（即旅行商问题）的遗传算法-the process of multi-city tsp (ie, the traveling salesman problem) Genetic Algorithm
Platform: | Size: 1171456 | Author: 叶靥 | Hits:

[Mathimatics-Numerical algorithms] TSP_orC

Description: TSP算法 1.C语言TSP算法 2.2-OPT，orOPT摄动 3.Main单独执行-TSP algorithm 1.C language TSP algorithm 2.2-OPT, orOPT perturbation separately 3.Main
Platform: | Size: 2048 | Author: DuDu Ch | Hits:

[matlab] TSP

Description: 用模拟退火算法求解TSP问题 [1]主函数tsp.m [2]计算路径长度的子函数 route_long.m [3]随机交换两个节点的顺序函数exchange.m-Using simulated annealing algorithm for solving TSP problems [1] the main function tsp.m [2] calculation of path length of Functions route_long.m [3] randomly exchange the order of two nodes function exchange.m
Platform: | Size: 1024 | Author: 齐亚超 | Hits:

[AI-NN-PR] 2

Description: PSO求解TSP问题的参考文献，查询学校IEEE检索得到！-Particle Swarm Optimization Based on Neighborhood Encoding for Traveling Salesman Problem
Platform: | Size: 318464 | Author: asdwe | Hits:

[Windows Develop] ant

Description: 蚁群算法结合2-opt技术解决旅行商问题（TSP）-Ant colony algorithm with 2-opt technology to solve the traveling salesman problem (TSP)
Platform: | Size: 3737600 | Author: newshowing | Hits:

[AI-NN-PR] 2

Description: tsp遗传算法代码 利用交叉算子改进方法求解旅行商问题-tsp genetic algorithm code
Platform: | Size: 2048 | Author: mm | Hits:

[AI-NN-PR] aco

Description: 蚁群算法解欧氏平面上的TSP问题。包括了2-opt、3-opt优化，经过了若干经典数据的测试。-AntColony algorithm solving the TSP problem in Euclid plane, including 2-opt and 3-opt optimization. It has been tested by authorized data.
Platform: | Size: 13312 | Author: sunli | Hits:

[Algorithm] 2opt.tsp.cpp

Description: Its a C/C++ implementation of 2-opt algorithm for Solving Travelling Salesman Problem.
Platform: | Size: 2048 | Author: Prasenjit Nag | Hits:

[AI-NN-PR] 12345

Description: 自己编写的带2-opt法的蚁群算法求解TSP，可以运行，运行环境VS2008-His writing with 2-opt method of ant colony algorithm for solving TSP, can run, run VS2008 environment
Platform: | Size: 1044480 | Author: she | Hits:

[Other] solve-the-TSP

Description: E:\学习\人工智能\禁忌搜索 +opt解决TSP问题\禁忌搜索+opt解决TSP问题 含测试数据-E: \ learning \ Artificial Intelligence \ tabu search \ taboo search to+opt for to solve the TSP \ taboo search to+opt for to solve the TSP
Platform: | Size: 3072 | Author: yang | Hits:

[matlab] nearest_neighbor_2opt

Description: Nearest Neighbor for TSP with 2-opt MATLAB
Platform: | Size: 1024 | Author: Yener | Hits:

[matlab] farthest_insertion_2opt

Description: Fartest Insertion for TSP with 2-opt MATLAB
Platform: | Size: 1024 | Author: Yener | Hits:

[matlab] random_tour_2opt

Description: Random Tour for TSP with 2-opt MATLAB
Platform: | Size: 1024 | Author: Yener | Hits:

[matlab] Analyzing-2-opt

Description: Analyzing 2-opt for Traveling Salesman problem (TSP)
Platform: | Size: 1024 | Author: BB | Hits:

[matlab] twice-update-PSO

Description: 本文二次更新型粒子群算法（ TUPSO）的基本思想是：一方面，在保留粒子群算法中快速收敛， 易于实现， 调整参数少等优势的前提下，通过融合基本粒子群算法中的信息共享原理与 DPSO-TSP 中的 2-Opt 运算法则，改进了DPSO-TSP中粒子进化的规则-In this paper, the basic idea of the new particle swarm optimization (TUPSO) algorithm is: on the one hand, by integrating the particle swarm optimization algorithm in the fast convergence, easy to achieve, adjust the parameters of less advantage of the premise, through the integration of basic particle swarm algorithm information sharing Principle and the 2-Opt algorithm in DPSO-TSP improves the rule of particle evolution in DPSO-TSP
Platform: | Size: 4096 | Author: CAITONGCHEN | Hits:

[Software Engineering] HM-TSP

Description: Heuristic method for the Traveling Salesman Problem A number of nearest neighbour tours are generated randomly selected starting points. Each tour is improved by 2-opt heuristics (pairwise exchange of edges) and the best result is selected. function tspplot(p,X,nodenum) #ok TSPPLOT Plot 2D tour TSPPLOT(P,X), P is the tour and X is the coordinate matrix TSPPLOT(P,X,1) also adds node numbers-Heuristic method for the Traveling Salesman Problem A number of nearest neighbour tours are generated randomly selected starting points. Each tour is improved by 2-opt heuristics (pairwise exchange of edges) and the best result is selected. function tspplot(p,X,nodenum) #ok TSPPLOT Plot 2D tour TSPPLOT(P,X), P is the tour and X is the coordinate matrix TSPPLOT(P,X,1) also adds node numbers
Platform: | Size: 2048 | Author: ahmed | Hits:

[Windows Develop] ACA_2opt

Description: 将蚁群算法与2交换邻域搜索算法结合，用MATLAB编程实现(The ant colony algorithm and 2 - exchange neighborhood search algorithm were combined and realized by MATLAB programming)
Platform: | Size: 18432 | Author: 星月之都 | Hits:

[Applications] 2-opt

Description: 运用2-opt算法解决TSP（旅行商问题），满足自定义五个点及自设迭代次数，包括可视化结果。(TSP (Traveling Salesman Problem) is solved by using 2-opt algorithm, which satisfies five custom points and self-designed iteration times, including visualization results.)
Platform: | Size: 1024 | Author: glam | Hits:
« 12 »

CodeBus www.codebus.net